An Optimal Two-Stage Decoding Algorithm for Linear Block Codes
نویسندگان
چکیده
A new optimal two stages decoding algorithm for linear block codes is presented. At first stage, the minimum sufficient test set Ŝ is estimated. With the minimum sufficient test set, decoding complexity can be greatly reduced while maintaining the optimal performance. At the second stage, ordered processing is performed over the estimated minimum sufficient test set Ŝ to find the optimal solution. Ordered processing helps to find the optimal solution quickly and in the meanwhile enables complexity-reduced sub-optimal solution with bounded block error rate. Simulation result shows that this algorithm achieves the optimal performance with low average computational complexity.
منابع مشابه
An Iterative Soft-Input Soft-Output Decoding Algorithm for Linear Block Codes
In this paper, reduced-complexity trellis-based soft-input soft-output (SISO) decoding of linear block codes is considered. A new low-weight subtrellis based SISO decoding algorithm for linear block code to achieve near optimal error performance with a significant reduction in decoding complexity is presented. The proposed scheme is suitable for iterative decoding of linear block codes when use...
متن کاملCooperative Orthogonal Space-Time-Frequency Block Codes over a MIMO-OFDM Frequency Selective Channel
In this paper, a cooperative algorithm to improve the orthogonal space-timefrequency block codes (OSTFBC) in frequency selective channels for 2*1, 2*2, 4*1, 4*2 MIMO-OFDM systems, is presented. The algorithm of three node, a source node, a relay node and a destination node is formed, and is implemented in two stages. During the first stage, the destination and the relay antennas receive the sym...
متن کاملA Simple One-Sweep Algorithm for Optimal APP Symbol Decoding of Linear Block Codes
Soft-input/soft-output symbol decoding plays a significant role in iterative decoding. We propose a simple optimal soft-input/softoutput symbol decoding algorithm for linear block codes which requires one forward recursion using a trellis. For many codes the decoding complexity is lower than previous methods, such as the algorithm by Bahl et al. [1], and the decrease is shown at its most when d...
متن کاملDecoding of Block and Convolutional Codes in Rank Metric DISSERTATION
Rank-metric codes recently attract a lot of attention due to their possible application to network coding, cryptography, space-time coding and distributed storage. An optimal-cardinality algebraic code construction in rank metric was introduced some decades ago by Delsarte, Gabidulin and Roth. This Reed–Solomon-like code class is based on the evaluation of linearized polynomials and is nowadays...
متن کاملDecoding of block and convolutional codes in rank metric
R ank-metric codes recently attract a lot of attention due to their possible application to network coding, cryptography, space-time coding and distributed storage. An optimal-cardinality algebraic code construction in rank metric was introduced some decades ago by Delsarte, Gabidulin and Roth. This Reed–Solomon-like code class is based on the evaluation of linearized polynomials and is nowaday...
متن کامل